An algorithm for solving the principal ideal problem with subfields

The principal ideal (PIP) is the problem of deciding whether a given number field and, if it is, finding generator. Solving PIP applies to solving major computational tasks in theory. It also connected search approximate short vectors so-called lattices which crucial cryptography. In this paper, we present novel application norm relations utilize information from subfields solve fields degree larger than 1800.